A Genetic XK-Means Algorithm with Empty Cluster Reassignment
نویسندگان
چکیده
منابع مشابه
Hybrid K-means Algorithm and Genetic Algorithm for Cluster Analysis
Cluster analysis is a fundamental technique for various filed such as pattern recognition, machine learning and so forth. However, the cluster number is predefined by users in K-means algorithm, which is unpractical to implement. Since the number of clusters is a NP-complete problem, Genetic Algorithm is employed to solve it. In addition, due to the large time consuming in conventional method, ...
متن کاملSkill Set Profile Clustering: The Empty K-Means Algorithm with Automatic Specification of Starting Cluster Centers
While students’ skill set profiles can be estimated with formal cognitive diagnosis models [8], their computational complexity makes simpler proxy skill estimates attractive [1, 4, 6]. These estimates can be clustered to generate groups of similar students. Often hierarchical agglomerative clustering or k-means clustering is utilized, requiring, for K skills, the specification of 2K clusters. T...
متن کاملA Modified k-means Algorithm to Avoid Empty Clusters
The k-means algorithm is one of the most widely used clustering algorithms and has been applied in many fields of science and technology. One of the major problems of the k-means algorithm is that it may produce empty clusters depending on initial center vectors. For static execution of the k-means, this problem is considered insignificant and can be solved by executing the algorithm for a numb...
متن کاملGenetic K-means algorithm
In this paper, we propose a novel hybrid genetic algorithm (GA) that finds a globally optimal partition of a given data into a specified number of clusters. GA's used earlier in clustering employ either an expensive crossover operator to generate valid child chromosomes from parent chromosomes or a costly fitness function or both. To circumvent these expensive operations, we hybridize GA with a...
متن کاملClustering with Niching Genetic K-means Algorithm
GA-based clustering algorithms often employ either simple GA, steady state GA or their variants and fail to consistently and efficiently identify high quality solutions (best known optima) of given clustering problems, which involve large data sets with many local optima. To circumvent this problem, we propose Niching Genetic K-means Algorithm (NGKA) that is based on modified deterministic crow...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2019
ISSN: 2073-8994
DOI: 10.3390/sym11060744